A filled function method for constrained global optimization
نویسندگان
چکیده
In this paper, a Þlled function for escaping the current local minimizer of a constrained global optimization problem is proposed. Then a Þlled function method for obtaining a global minimizer of the constrained optimization problem is presented. By this method, a global minimizer of a constrained global optimization problem can be obtained just by searching local minimizers of the original constrained optimization problem and some unconstrained programming problems constructed by the given Þlled functions. Some Numerical results demonstrate the efficiency of this global method for constrained global optimization.
منابع مشابه
A New Quasi-Filled Function Method for Constrained Global Optimization
In this paper, a class of new auxiliary function with one parameter on constrained problem for escaping the current local minimizer of global optimization problem is proposed. Firstly, we give a definition of the quasifilled function for constrained problem and under some mild assumptions, we prove the proposed auxiliary function is a quasi-filled function. Then, a new algorithm is presented ac...
متن کاملA filled function method with one parameter for unconstrained global optimization
For Rn constrained global optimization problem, a new auxiliary function with one parameter is proposed for escaping the current local minimizer. First, a new definition of filled function is given and under mild assumptions, it is proved to be a filled function. Then a new algorithm is designed according to the theoretical analysis and some preliminary numerical results are given to demonstrat...
متن کاملA filled function method for nonlinear systems of equalities and inequalities ∗
In this paper a filled function method is suggested for solving nonlinear systems of equalities and inequalities. Firstly, the original problem is reformulated into an equivalent constrained global optimization problem. Subsequently, a new filled function with one parameter is constructed based on the special characteristics of the reformulated optimization problem. Some properties of the fille...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملImproving Chernoff criterion for classification by using the filled function
Linear discriminant analysis is a well-known matrix-based dimensionality reduction method. It is a supervised feature extraction method used in two-class classification problems. However, it is incapable of dealing with data in which classes have unequal covariance matrices. Taking this issue, the Chernoff distance is an appropriate criterion to measure distances between distributions. In the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Global Optimization
دوره 39 شماره
صفحات -
تاریخ انتشار 2007